AN UPPER BOUND FOR CODES IN A TWO-ACCESS BINARY ERASURE CHANNELVAN TILBORG HCA.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 1; PP. 112-116; BIBL. 5 REF.Article

UPPER BOUNDS ON !C₂! FOR A UNIQUELY DECODABLE CODE PARI (C₁, C₂) FOR A TWO-ACCESS BINARY ADDER CHANNELVAN TILBORG HCA.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 3; PP. 386-389; BIBL. 9 REF.Article

UNIFORMILY PACKED CODES.GOETHALS JM; VAN TILBORG HCA.1975; PHILIPS RES. REP.; NETHERL.; DA. 1975; VOL. 30; NO 1; PP. 9-36; BIBL. 24 REF.Article